A simplification of the double-sweep algorithm to solve the k-shortest path problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملA New Parallel Algorithm to Solve the Near- Shortest-Path Problem on Raster Graphs
The Near Shortest Path algorithm (Carlyle and Wood 2005) has been identified as being effective at generating sets of good route alternatives for developing new infrastructure. While the algorithm itself is faster than other shortest path set approaches such as solving the k-th shortest path problem, the solution set size and computation time grows exponentially as the problem size increases an...
متن کاملA hierarchical Algorithm to Solve the Shortest Path Problem in Valued Graphs
This paper details a new algorithm to solve the shortest path problem in valued graphs. Its complexity is O(D log v) where D is the graph diameter and v its number of vertices. This complexity has to be compared to the one of the Dijkstra’s algorithm, which is O(e log v) where e is the number of edges of the graph. This new algorithm lies on a hierarchical representation of the graph, using rad...
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2000
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(00)00099-9